A Burrows-Wheeler Transform Based Method for DNA Sequence Comparison
نویسندگان
چکیده
منابع مشابه
A burrows-wheeler transform based method for DNA sequence comparison
Burrows-Wheeler Transform (BWT) is an extremely useful tool for textual lossless data compression. Recently, it has found many applications to bioinformatics. In this paper, BWT is introduced from the view of combinatorics, and then an equivalence relation on words is proposed which shows that the transformation captures some common features of equivalent words. Based on the rationale that to w...
متن کاملDNA Sequence Compression Using the Burrows-Wheeler Transform
We investigate off-line dictionary oriented approaches to DNA sequence compression, based on the Burrows-Wheeler Transform (BWT). The preponderance of short repeating patterns is an important phenomenon in biological sequences. Here, we propose off-line methods to compress DNA sequences that exploit the different repetition structures inherent in such sequences. Repetition analysis is performed...
متن کاملSyllable-Based Burrows-Wheeler Transform
The Burrows-Wheeler Transform (BWT) is a compression method which reorders an input string into the form, which is preferable to another compression. Usually Move-To-Front transform and then Huffman coding is used to the permutated string. The original method [3] from 1994 was designed for an alphabet compression. In 2001, versions working with word and n-grams alphabet were presented. The newe...
متن کاملDynamic Burrows-Wheeler Transform
The Burrows-Wheeler Transform is a building block for many text compression applications and self-index data structures. It reorders the letters of a text T to obtain a new text bwt(T ) which can be better compressed. This forward transform has been intensively studied over the years, but a major problem still remains: bwt(T ) has to be entirely recomputed whenever T is modified. In this articl...
متن کاملSearching for Unique DNA Sequences with the Burrows-Wheeler Transform
The objective of this study was to present an efficient algorithm that effectively aids the problem of searching for unique DNA sequences in the set of genes. The presented algorithm is based on the Burrows-Wheeler Transform (BWT), a very fast and effective data compression algorithm. The developed algorithm exploits all the advantages offered by the BWT algorithm and the suffix array data stru...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Biology and Bioinformatics
سال: 2014
ISSN: 2330-8265
DOI: 10.11648/j.cbb.20140203.11